Subgroups of Polynomial Automorphisms

نویسندگان

  • EDWIN CONNELL
  • JOHN ZWEIBEL
  • J. ZWEIBEL
چکیده

Throughout this paper, k will denote a commutative ring containing the rational numbers Q, and k = k[x{, . . . , xn] will be the polynomial ring over k . If ƒ : k —• k is a polynomial map (i.e., a fc-algebra homomorphism), then ƒ is a polynomial automorphism provided there is an inverse ƒ " which is also a polynomial map. Very little is known about the group of polynomial automorphisms, and indeed it is difficult to determine which polynomial maps are automorphisms. The purpose of this paper is to define a collection H of polynomial maps, to show that each h e H is a polynomial automorphism and that if is a group under composition, and to classify H up to group isomorphism. As a consequence, this will prove a special case of the Jacobian conjecture. If V is an «-dimensional column vector over k whose /th term is vt, then the Jacobian J(V) is defined to be the n x n matrix (dvjdx.). Let X denote the vector whose /th term is xi. If g: k [n] —• k is a polynomial map, then g(X) will denote the vector whose /th term is g(x.). This gives a bijection from polynomial maps to vectors. The Jacobian J(g) of a polynomial map g is defined to be the Jacobian of the vector g(X). Suppose for the moment that k is a field of characteristic 0. The Jacobian conjecture states that if ƒ: k —> k is a polynomial map with \J(f)\ = 1, then ƒ is a polynomial automorphism. It is known that this conjecture can be reduced to the case where / (ƒ ) = I + M, where each term of the matrix M is a homogeneous polynomial of degree 2 [BCW]. It follows from the theorem below that the Jacobian conjecture is true, provided it can be reduced to the case where J{f)~ = I N, where each term of N is homogeneous of some fixed degree q > 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

On Certain Questions of the Free Group Automorphisms Theory

Certain subgroups of the groups Aut(Fn) of automorphisms of a free group Fn are considered. Comparing Alexander polynomials of two poly-free groups Cb+4 and P4 we prove that these groups are not isomorphic, despite the fact that they have a lot of common properties. This answers the question of Cohen-Pakianathan-Vershinin-Wu from [8]. The questions of linearity of subgroups of Aut(Fn) are consi...

متن کامل

Computational Approaches to Poisson Traces Associated to Finite Subgroups of SP2n(ℂ)

We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension in each degree. This applies more generally to traces on all polynomial functions which are invariant under invariant Hamiltonian flow. We implement these a...

متن کامل

Hausdorff dimension in a family of self-similar groups

For each prime p and a monic polynomial f , invertible over p, we define a group Gp,f of p-adic automorphisms of the p-ary rooted tree. The groups are modeled after the first Grigorchuk group, which in this setting is the group G2,x2+x+1. We show that the constructed groups are self-similar, regular branch groups. This enables us to calculate the Hausdorff dimension of their closures, providing...

متن کامل

Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G)  euv nu (e)  nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...

متن کامل

Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes

Let q = pr be a prime power, and let f(x) = xm − σm−1x m−1 − · · · − σ1x− σ0 be an irreducible polynomial over the finite field GF(q) of size q. A zero ξ of f is called nonstandard (of degree m) over GF(q) if the recurrence relation um = σm−1um−1 + · · · + σ1u1 + σ0u0 with characteristic polynomial f can generate the powers of ξ in a nontrivial way, that is, with u0 = 1 and f(u1) 6= 0. In 2003,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007